Algorithms and uncertainty sets for data-driven robust shortest path problems
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملAn Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems
Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the network may not be known. This led to the development of robust shortest path problems, where all possible arc travel times are contained in a so-called uncerta...
متن کاملRobust shortest path problems
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...
متن کاملalgorithms for biobjective shortest path problems in fuzzy networks
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملRobust constrained shortest path problems under budgeted uncertainty
We study the robust constrained shortest path problem under resource uncertainty. After proving that the problem is NP-hard in the strong sense for arbitrary uncertainty sets, we focus on budgeted uncertainty sets introduced by Bertsimas and Sim (2003) and their extension to variable uncertainty by Poss (2013). We apply classical techniques to show that the problem with capacity constraints can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.10.006